Automatic Data Distribution Optimisation in a Lazy, Self-optimising Parallel Matrix Library (extended Abstract)
نویسندگان
چکیده
This short paper describes a matrix-vector library implementation running on the Fujitsu AP1000. The library optimises data distribution at run-time, taking advantage of information about how operands and results are used by delaying evaluation where possible. The work extends our earlier paper on the subject 5] by giving a general methodology for representing data distributions, which is then used for formulating the optimisation problem and for describing an optimisation algorithm.
منابع مشابه
Runtime Interprocedural Data Placement Optimisation for Lazy Parallel Libraries (Extended Abstract)
We are developing a lazy, self-optimising parallel library of vector-matrix routines. The aim is to allow users to parallelise certain computationally expensive parts of numerical programs by simply linking with a parallel rather than sequential library of subroutines. The library performs interprocedural data placement optimisation at runtime, which requires the optimiser itself to be very eec...
متن کاملEecient Interprocedural Data Placement Optimisation in a Parallel Library
This paper describes a combination of methods which make interprocedural data placement optimisation available to parallel libraries. We propose a delayed-evaluation, self-optimising (DESO) numerical library for a distributed-memory multicomputer. Delayed evaluation allows us to capture the control-ow of a user program from within the library at runtime, and to construct an optimised execution ...
متن کاملEfficient Interprocedural Data Placement Optimisation in a Parallel Library
This paper describes a combination of methods which make interprocedural data placement optimisation available to parallel libraries. We propose a delayed-evaluation, self-optimising (DESO) numerical library for a distributed-memory multicomputer. Delayed evaluation allows us to capture the control-ow of a user program from within the library at runtime, and to construct an optimised execution ...
متن کاملInterprocedural optimisation of regular parallel computations at runtime
This thesis concerns techniques for efficient runtime optimisation of regular parallel programs that are built from separate software components. High-quality, high-performance parallel software is frequently built from separately-written reusable software components such as functions from a library of parallel routines. Apart from the strong case from the software engineering point-of-view for...
متن کاملA Lazy, Self-optimizing Parallel Matrix Library
This paper describes a parallel implementation of a matrix/vector library for C++ for a large distributed-memory multicomputer. The library is “self-optimising” by exploiting lazy evaluation: execution of matrix operations is delayed as much as possible. This exposes the context in which each intermediate result is used. The run-time system extracts a functional representation of the values bei...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1996